Symmetries of Quasi-Values

According to Shapley’s game-theoretical result, there exists a unique game value of finite cooperative games that satisfies axioms on additivity, efficiency, null-player property and symmetry. The original setting requires symmetry with respect to arbitrary permutations of players. We analyze the consequences of weakening the symmetry axioms and study quasi-values that are symmetric with respect to permutations from a group G ≤ Sn. We classify all the permutation groups G that are large enough to assure a unique G-symmetric quasi-value, as well as the structure and dimension of the space of all such quasi-values for a general permutation group G. We show how to construct G-symmetric quasi-values algorithmically by averaging certain basic quasi-values (marginal operators).